A provably complete exploration strategy by constructing Voronoi diagrams

نویسندگان

  • Jonghoek Kim
  • Fumin Zhang
  • Magnus Egerstedt
چکیده

We present novel exploration algorithms and a control law that enables the construction of Voronoi diagrams over unknown areas using a single vehicle equipped with range sensors. The control law uses range measurements to make the vehicle track Voronoi edges between obstacles. The exploration algorithms make decisions at vertices in the Voronoi diagram to expand the explored area until a complete Voronoi diagram is constructed in finite time. Our exploration algorithms are provably complete, and the convergence of the control law is guaranteed. Simulations and experimental results are provided to demonstrate the effectiveness of both the control law and the exploration algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Cooperative Exploration and Networking Based on Voronoi Diagrams

We develop a strategy that enables multiple intelligent vehicles to cooperatively explore complex and dangerous territories. Every vehicle drops communication devices and expands an information network while constructing a topological map based on the Voronoi diagram. As the information network weaved by each vehicle grows, intersections eventually happen so that the networks are shared. This a...

متن کامل

An exploration strategy based on construction of Voronoi diagrams

We present novel exploration algorithms and control law that enable the construction of Voronoi diagram in an initially unknown area using one vehicle equipped with range scanners. Our control law and exploration algorithms are provably complete, i.e., convergence is guaranteed. The control laws use range measurements to make the vehicle track Voronoi edges between two obstacles. The exploratio...

متن کامل

Convex Hull and Voronoi Diagram of Additively Weighted Points

We provide a complete description of dynamic algorithms for constructing convex hulls and Voronoi diagrams of additively weighted points of R. We present simple algorithms and provide a complete description of all the predicates. The algorithms have been implemented in R and experimental results are reported. Our implementation follows the CGAL design and, in particular, is made both robust and...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Algorithms for Complex Shapes with Certified Numerics and Topology Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space

We present a general framework for computing two-dimensional Voronoi diagrams of different site classes under various distance functions. The computation of the diagrams employs the cgal software for constructing envelopes of surfaces in 3-space, which implements a divide-and-conquer algorithm. A straightforward application of the divide-and-conquer approach for Voronoi diagrams yields highly i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Auton. Robots

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2010